|
|
Models of Queueing Systems
Horký, Miroslav ; Dvořák, Jiří (referee) ; Šeda, Miloš (advisor)
The master’s thesis solves models of queueing systems, which use the property of Markov chains. The queueing system is a system, where the objects enter into this system in random moments and require the service. This thesis solves specifically such models of queueing systems, in which the intervals between the objects incomings and service time have exponential distribution. In the theoretical part of the master’s thesis I deal with the topics stochastic process, queueing theory, classification of models and description of the models having Markovian property. In the practical part I describe realization and function of the program, which solves simulation of chosen model M/M/m. At the end I compare results which were calculated in analytic way and by simulation of the model M/M/m.
|
|
|
Queueing theory utilization in packet network design and optimization process
Rýzner, Zdeněk ; Zeman, Václav (referee) ; Novotný, Vít (advisor)
This master's thesis deals with queueing theory and its application in designing node models in packet-switched network. There are described general principles of designing queueing theory models and its mathematical background. Further simulator of packet delay in network was created. This application implements two described models - M/M/1 and M/G/1. Application can be used for simulating network nodes and obtaining basic network characteristics like packet delay or packet loss. Next, lab exercise was created, in that exercise students familiarize themselves with basic concepts of queueing theory and examine both analytical and simulation approach to solving queueing systems.
|
|
|
Efficient Analysis of Stochastic Biochemical Systems
Tušimová, Lucia ; Hruška, Martin (referee) ; Češka, Milan (advisor)
The aim of the thesis is to make computation of the biochemical reaction networks more efficient. Modeling of biochemical systems using numerical methods uses continuous-time Markov chains. The problem is that in biochemical reactions arises an unmanageable amount of states. The fast adaptive uniformization method solves this problem at the cost of a small rounding mistake. This method was implemented in the STORM, which is tool for the analysis of systems involving random or probabilistic phenomena. Consequently, the effectiveness of this method was verified on a set of experiments.
|
|
|
Efficient Analysis of Stochastic Biochemical Systems
Tušimová, Lucia ; Hruška, Martin (referee) ; Češka, Milan (advisor)
The aim of the thesis is to make computation of the biochemical reaction networks more efficient. Modeling of biochemical systems using numerical methods uses continuous-time Markov chains. The problem is that in biochemical reactions arises an unmanageable amount of states. The fast adaptive uniformization method solves this problem at the cost of a small rounding mistake. This method was implemented in the STORM, which is tool for the analysis of systems involving random or probabilistic phenomena. Consequently, the effectiveness of this method was verified on a set of experiments.
|
|
|
Models of Queueing Systems
Horký, Miroslav ; Dvořák, Jiří (referee) ; Šeda, Miloš (advisor)
The master’s thesis solves models of queueing systems, which use the property of Markov chains. The queueing system is a system, where the objects enter into this system in random moments and require the service. This thesis solves specifically such models of queueing systems, in which the intervals between the objects incomings and service time have exponential distribution. In the theoretical part of the master’s thesis I deal with the topics stochastic process, queueing theory, classification of models and description of the models having Markovian property. In the practical part I describe realization and function of the program, which solves simulation of chosen model M/M/m. At the end I compare results which were calculated in analytic way and by simulation of the model M/M/m.
|
|
|
Queueing theory utilization in packet network design and optimization process
Rýzner, Zdeněk ; Zeman, Václav (referee) ; Novotný, Vít (advisor)
This master's thesis deals with queueing theory and its application in designing node models in packet-switched network. There are described general principles of designing queueing theory models and its mathematical background. Further simulator of packet delay in network was created. This application implements two described models - M/M/1 and M/G/1. Application can be used for simulating network nodes and obtaining basic network characteristics like packet delay or packet loss. Next, lab exercise was created, in that exercise students familiarize themselves with basic concepts of queueing theory and examine both analytical and simulation approach to solving queueing systems.
|
guest ::
